Abstracting Path Conditions for Effective Symbolic Execution
نویسنده
چکیده
ing Path Conditions for Effective Symbolic Execution Marek Trt́ık [email protected]
منابع مشابه
SPA: Symbolic Program Approximation for Scalable Path-sensitive Analysis
Symbolic execution is a static-analysis technique that has been used for applications such as test-input generation and change analysis. Symbolic execution’s path sensitivity makes scaling it difficult. Despite recent advances that reduce the number of paths to explore, the scalability problem remains. Moreover, there are applications that require the analysis of all paths in a program fragment...
متن کاملSymbolic execution of oating point computations
Symbolic execution is a classical program testing technique which evaluates a se lected control ow path with symbolic input data A constraint solver can be used to enforce the satis ability of the extracted path conditions as well as to derive test data Whenever path conditions contain oating point computations a common strategy consists of using a constraint solver over the rationals or the re...
متن کاملSymbolic execution of floating-point computations
Symbolic execution is a classical program testing technique which evaluates a selected control flow path with symbolic input data. A constraint solver can be used to enforce the satisfiability of the extracted path conditions as well as to derive test data. Whenever path conditions contain floating-point computations, a common strategy consists of using a constraint solver over the rationals or...
متن کاملDynamic Symbolic Execution for Testing Distributed Objects
This paper extends dynamic symbolic execution to distributed and concurrent systems. Dynamic symbolic execution can be used in software testing to systematically identify equivalence classes of input values and has been shown to scale well to large systems. Although mainly applied to sequential programs, this scalability makes it interesting to consider the technique in the distributed and conc...
متن کاملParallel SMT-Constrained Symbolic Execution for Eclipse CDT/Codan
This paper presents a parallel symbolic execution engine as a plug-in extension to Eclipse CDT/Codan. It uses the CDT parser and the control flow graph builder from CDT’s code analysis framework (Codan). Path satisfiability and bug conditions are checked with an SMT solver in the logic of arrays, uninterpreted functions and nonlinear integer and real arithmetic (AUFNIRA). Each worker of the par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1112.4703 شماره
صفحات -
تاریخ انتشار 2011